منابع مشابه
Simulations Between Cellular Automata on Cayley Graphs
We consider cellular automata on Cayley graphs and compare their computational powers according to the architecture on which t h e y work. We show that, if there exists a homomorphism with a nite kernel from a group into another one such that the image of the rst group has a nite index in the second one, then every cellular automaton on the Cayley graph of one of these groups can be uni-formall...
متن کاملDiffusion in Lorentz Lattice Gas Automata with Backscattering
The probability of first return to the initial interval x and the diffusion tensor D~a are calculated exactly for a ballistic Lorentz gas on a Bethe lattice or Cayley tree. It consists of a moving particle and a fixed array of scatterers, located at the nodes, and the lengths of the intervals between scatterers are determined by a geometric distribution. The same values for x and D=a apply also...
متن کاملDiscrete Lorentz covariance for quantum walks and quantum cellular automata
We formalize a notion of discrete Lorentz transforms for quantum walks (QW) and quantum cellular automata (QCA), in + (1 1)-dimensional discrete spacetime. The theory admits a diagrammatic representation in terms of a few local, circuit equivalence rules. Within this framework, we show the first-order-only covariance of the Dirac QW. We then introduce the clock QW and the clock QCA, and prove t...
متن کاملDe Bruijn Graphs and Linear Cellular Automata
De Bruijn graphs provide a convenient way to describe configura tions of linear cellular automata (CAs). Using these graphs, we give a simple quadra tic time algorithm to determine whether a linear CA is reversible. Similarly, one can decide in quadratic time whether the global map of the auto mato n is surjective. We also show that every recursive configuration that has a predecessor on a line...
متن کاملA Geometrical Hierarchy on Graphs via Cellular Automata
Historically, cellular automata were deened on the lattices Z n , but the deenition can be extended to bounded degree graphs. Given a notion of simulation between cellular automata deened on diierent structures (namely graphs of automata), we can deduce an order on graphs. In this paper, we link this order to graph properties and explicit the order for most of the common graphs. R esum e Histor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00278-0